#include"Sort.h"

//void TestQuickSortNonR()
//{
//	int a[] = { 2,4,5,6,7,1,3,8 };
//	PrintArray(a, sizeof(a) / sizeof(a[0]));
//	QuickSortNonR(a, 0, sizeof(a) / sizeof(a[0])-1);
//	PrintArray(a, sizeof(a) / sizeof(a[0]));
//}


//void TestMergeSort()
//{
//	int a[] = {2,4,5,6,7,1,3,8};
//	PrintArray(a, sizeof(a) / sizeof(a[0]));
//	MergeSort(a,sizeof(a) / sizeof(a[0]));
//	PrintArray(a, sizeof(a) / sizeof(a[0]));
//}

void TestMergeSortNonR()
{
	int a[] = {2,4,5,6,7,1,3,8,10,9};
	PrintArray(a, sizeof(a) / sizeof(a[0]));
	MergeSortNonR(a, sizeof(a) / sizeof(a[0]));
	PrintArray(a, sizeof(a) / sizeof(a[0]));
}


int main()
{
	//TestQuickSortNonR();
	//TestMergeSort();
	TestMergeSortNonR();
}












